搜索资源列表
NFA-to-DFA
- Theory: NDFA: It is a mathematical model containing 5 tuples a) Q- finite non empty set elements of which are called as state. b) T- set of alphabets. c) δ- is a mapping function Q*{T {λ}}*2Q d) S-start state i.e. S ε Q e) F- F (su
BYYL
- 编译原理 实现标准C语言词法分析器 掌握程序设计语言词法分析的设计方法； 2．掌握DFA的设计与使用方法； 3．掌握正规式到有限自动机的构造方法； -Compiling principle realize standard C language lexical parsers Master program design language of lexical analysis design method 2. Master DFA design and method o
Finite-state-automata-Uncomment
- 关于使用有限状态自动机将程序的注释去除（不含print中的注释~）-Remove program notes on the use of finite state automata (excluding print the comments in the ~)
DFAminimization
- A program that minimizes a deterministic finite automata
Word_Analyst
- 华东交通大学编译原理实验题，词法分析程序java源代码，赋值表达式的实现，有穷自动机-The east China jiaotong university, compiling principle experimental subject, lexical analysis program Java source code, and the realization of an assignment expression, have finite automata
yxzdj
- 关键字：编译原理；算法；有限自动机 描述：有限自动机主要是应用一种巧妙的方法把一则文法化简并把程序当中不确定的走向确定化，使程序在每执行一步都有一个确定的走向。减少计算量，也使使用程序来判断字符串是否符合文法成为可能。-Compilation principle algorithm Finite automata
AutoMat
- MFC制作的文法生成有限自动机程序。能够将你输入的文法转化成自动机。并且能够判断文法的对错。-MFC production grammar generates a finite automata program. You enter the grammar can be transformed into automata. Grammar and be able to judge right or wrong.
nfa-to-dfa
- 编译实验，实线有穷自动机，nfa到dfa-Compile the experiment, solid line finite automata, nfa to dfa
Regular-expres
- 实现有穷自动机，NFA到DFA的最小化，实现最长匹配-Realization of finite automata, NFA to DFA, minimize, the longest match
shiyan2
- 编译原理实验：程序段的单词识别。：给定某种语言的语法规则，生成识别该语言单词的确定的有穷自动机（DFA），然后通过该DFA对该语言的程序段进行单词识别，给出识别的单词序列，每个单词用二元式表示-Compiler principle experiment: block word recognition. : Given a language grammar rules to generate finite automata (DFA) identify the word of the langua
scaner
- 编译原理扫描器，按照有限自动机和词法分析器的原理制作而成。-The compiler theory scanner, made in accordance with the principle of finite automata and lexical analyzer.
Machine
- 由正则表达式生成有限自动机,显示有限自动机的状态和动作等，方便学习有限自动机课程。-By regular expressions to generate a finite automaton states and actions of finite automata, to facilitate learning finite automata courses.
DFAjava
- 确定有限自动机最小化的java实现代码，-Finite automata minimization java implementation code
1
- 有限自动机的C++代码实现，完整，全面的阐述了有限自动机的工作原理-The finite automata C++ code to achieve the complete, comprehensive exposition of the works of the finite automata
reg2NFA
- 输入正则表达式生成图形化的有穷自动机；有助于正则表达式和有穷自动机之间的转换验证-Enter regular expressions to generate graphical finite automata help verify the conversion between regular expressions and finite automata
test1
- 从正则表达式到有穷自动机实例，自动机课程设计源码-From regular expressions to finite automata instance, automata curriculum design source
24130150
- 有穷自动机的实现，编译原理实验，编译原理的三个实验-The realization of finite automata, compiler theory experiments, compiler theory of three experiments
100410508
- 有穷自动机的实现，编译原理实验，编译原理的三个实验-The realization of finite automata, compiler theory experiments, compiler theory of three experiments
100410517
- 有穷自动机的实现，编译原理实验，编译原理的三个实验-The realization of finite automata, compiler theory experiments, compiler theory of three experiments Han Han Han
DFA
- 有限自动机的实现，可用于固定序列匹配，自然语言处理中的词干提取，词缀切分等-The realization of finite automata can be used for fixed sequence matching, natural language processing stemming, affixes cut grading